Serfs: Dynamically-bound parameterized components

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Serfs: Dynamically-bound parameterized components

Follow this and additional works at: http://engagedscholarship.csuohio.edu/enece_facpub Part of the Computer Engineering Commons Publisher's Statement NOTICE: this is the author’s version of a work that was accepted for publication in Journal of Systems and Software. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other qualit...

متن کامل

Computing Principal Components Dynamically

In this paper we present closed-form solutions for efficiently updating the prin-cipal components of a set of n points, when m points are added or deleted fromthe point set. For both operations performed on a discrete point set in R, we cancompute the new principal components in O(m) time for fixed d. This is a signifi-cant improvement over the commonly used approach of reco...

متن کامل

Betweenness parameterized above tight lower bound

We study ordinal embedding relaxations in the realm of parameterized complexity. We prove the existence of a quadratic kernel for the Betweenness problem parameterized above tight lower bound, which is stated as follows. For a set V of variables and set C of constraints “vi is between vj and vk”, decide whether there is a bijection from V to the set {1, . . . , |V |} satisfying at least |C|/3 +...

متن کامل

Configuration Management for Dynamically Bound Systems

Dynamically bound systems are those software systems which are able to incorporate executable components into themselves during execution. Such systems are clearly very flexible; however, they suffer from problems associated with this flexibility. These problems, which are similar to some of the problems addressed by configuration management, include how to locate and select components, how to ...

متن کامل

Dynamically Parameterized Algorithms and Architectures to Exploit Signal Variations

Signal processing algorithms and architectures can use dynamic reconfiguration to exploit variations in signal statistics with the objectives of improved performance and reduced power. Parameters provide a simple and formal way to characterize incremental changes to a computation and its computing mechanism. This paper develops a framework for dynamic parameterization and applies it to MPEG-4 m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Systems and Software

سال: 2007

ISSN: 0164-1212

DOI: 10.1016/j.jss.2006.07.024